|
Performance of a Few Gang Scheduling Algorithms
for Multiprocessor Scheduling
-- R Siyambalapitiya and M Sandirigama
In this study, the performance of several approximation algorithms for multiprocessor scheduling is considered. Multiprocessor scheduling is an NP-hard problem which means that it may not be possible to design exact algorithms to solve this problem to optimality. Therefore, designing of approximation algorithms to solve this problem appears to be the only option available. The algorithms considered are designed incorporating the gang scheduling approach. An attempt is made to obtain solutions close to optimal using these algorithms. The study shows that these algorithms can be used to solve even large-scale problems occurring in practice.
© 2013 IUP. All Rights Reserved.
Preprocessing Techniques for
Effective Data Extraction and Computation
--M Saraswathi and V Balu
World Wide Web information is semi-structured due to the nested structure of HTML code— a lot of information is linked, and much of the Web information is redundant. Web Text Mining helps the whole knowledge mining process to discover and extract the valuable information from unstructured text. The unstructured texts, which contain massive amount of information, cannot simply be used for further processing by computers. Therefore, this paper discusses the importance of standard preprocessing methods and various steps involved in getting the required content effectively. This paper proposes an effective preprocessing and dimensionality reduction technique, which helps in simplifying or speeding up computations; it can improve the text categorization and performance.
© 2013 IUP. All Rights Reserved.
A Division Algorithm-Based Symmetric
Key Encryption Algorithm
-- Shriram B Patil
The transmission of data between sender and receiver must be secure and accurate. For secure transmission, cryptography techniques are widely used. Many of the variants of algorithm use symmetric and public keys. In this paper, symmetric key encryption algorithm is designed using division algorithm a = qb + r, 0 r < b, where q and r are unique positive integers. The algorithm can be applied in decimal, binary or hexadecimal number system. The key space, the set of all possible keys, depends on the choice of 8 or 16-bit or even more number of bits in a key. The key space is generated using quotient q and remainder r in a division algorithm. The algorithm given in Narayana and Veereswara Swamy (2012) uses 8-bit key and is shown to be of this particular case.
© 2013 IUP. All Rights Reserved.
A Heart Disease Prediction Model Using Decision Tree
--Atul Kumar Pandey, Prabhat Pandey and K L Jaiswal
In this paper, we develop a heart disease prediction model that can assist medical professionals in predicting the heart disease status based on the clinical data of patients. First, we select 14 important clinical features; second, we develop a prediction model using J48 decision tree for classifying heart disease based on these clinical features against unpruned, pruned, and pruned with reduced error pruning approach. Finally, it is found that the accuracy of pruned J48 decision tree with reduced error pruning approach is better than the simple pruned and unpruned approach. The results obtained show that fasting blood sugar is the most important attribute which gives better classification against the other attributes but does not give better accuracy.
© 2013 IUP. All Rights Reserved.
Enhanced Fuzzy Image Processing Algorithm
for Multi-Focus Image Fusion
--Ramasamy Mariappan
In this paper, a multi-focus image fusion based on fuzzy image processing approach has been proposed. The fusion process is based on the fuzzy image processing steps: fuzzification, modification of membership values and defuzzification. The performance of the image fusion algorithm has been done using an activity level-based measure. Experimental results show that the proposed method performs better than the pixel level maximum and minimum method.
© 2013 IUP. All Rights Reserved.
|
